Combinatorial Optimization of Selective Assembly in Continuous Production.
نویسندگان
چکیده
منابع مشابه
Combinatorial Optimization in Pattern Assembly
Pattern self-assembly tile set synthesis (Pats) is a combinatorial optimization problem which aim at minimizing a rectilinear tile assembly system (RTAS) that uniquely self-assembles a given rectangular pattern, and is known to be NP-hard. Pats gets practically meaningful when it is parameterized by a constant c such that any given pattern is guaranteed to contain at most c colors (c-Pats). We ...
متن کاملOptimization of profit and customer satisfaction in combinatorial production and purchase model by genetic algorithm
Optimization of inventory costs is the most important goal in industries. But in many models, the constraints are considered simple and relaxed. Some actual constraints are to consider the combinatorial production and purchase models in multi-products environment. The purpose of this article is to improve the efficiency of inventory management and find the economic order quantity and economic p...
متن کاملCombinatorial Optimization and Verification in Self-Assembly
Two of the most studied tile self-assembly models in the literature are the abstract Tile Assembly Model (aTAM) [7] and the Two-Handed Tile Assembly Model (2HAM) [4]. Both models constitute a mathematical model of self-assembly in which system components are four-sided Wang tiles with glue types assigned to each tile edge. Any pair of glue types are assigned some nonnegative interaction strengt...
متن کاملCombinatorial Optimization of Matrix-Vector Multiplication in Finite Element Assembly
It has been shown that combinatorial optimization of matrix-vector multiplication can lead to faster evaluation of finite element stiffness matrices. Based on a graph model characterizing relationships between rows, an efficient set of operations can be generated to perform matrix-vector multiplication for this problem. We improve the graph model by extending the set of binary row relationships...
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C
سال: 1994
ISSN: 0387-5024,1884-8354
DOI: 10.1299/kikaic.60.1877